منابع مشابه
Specifications via Realizability
We present a system, called RZ, for automatic generation of program specifications from mathematical theories. We translate mathematical theories to specifications by computing their realizability interpretations in the ML language augmented with assertions (as comments). While the system is best suited for descriptions of those data structures that can be easily described in mathematical langu...
متن کاملRealizability Toposes from Specifications
We investigate a framework of Krivine realizability with I/O effects, and present a method of associating realizability models to specifications on the I/O behavior of processes, by using adequate interpretations of the central concepts of pole and proof-like term. This method does in particular allow to associate realizability models to computable functions. Following recent work of Streicher ...
متن کاملMaximum Realizability for Linear Temporal Logic Specifications
Automatic synthesis from linear temporal logic (LTL) specifications is widely used in robotic motion planning, control of autonomous systems, and load distribution in power networks. A common specification pattern in such applications consists of an LTL formula describing the requirements on the behaviour of the system, together with a set of additional desirable properties. We study the synthe...
متن کاملRealizability Analysis 1 Running head: REALIZABILITY ANALYSIS Realizability Analysis of Top-down Web Service Composition Specifications
A conversation protocol specifies the desired global behaviors of a web service composition in a top-down fashion. Before implementing a conversation protocol, its realizability has to be determined, i.e., can a bottom-up web service composition be synthesized so that it generates exactly the same set of conversations as specified by the protocol? This chapter presents three sufficient conditio...
متن کاملVerifying realizability and reachability in recursive interaction protocol specifications
The Propositional Statechart language described in [4] makes it possible to provide unambiguous joint diagrammatic specifications of complex recursive interaction protocols such as the multilateral voting protocol. Recursive protocols described using Propositional Statecharts are not necessarily finite state, meaning that verification of properties of these protocols cannot be achieved solely b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2006
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2005.08.007